On Finite Model Property of the Equational Theory of Kleene Algebras

نویسنده

  • Ewa Palka
چکیده

The finite model property of the equational fragment of the theory of Kleene algebras is a consequence of Kozen’s [3] completeness theorem. We show that, conversely, this completeness theorem can be proved assuming the finite model property of this fragment.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Action Logic

Pratt [22] defines action algebras as Kleene algebras with residuals and action logic as the equational theory of action algebras. In opposition to Kleene algebras, action algebras form a (finitely based) variety. Jipsen [9] proposes a Gentzen-style sequent system for action logic but leaves it as an open question if this system admits cut-elimination and if action logic is decidable. We show t...

متن کامل

Hypothesis Elimination in Kleene Semirings

—A Kleene Semiring (KS) is an algebraic structure satisfying the axioms of Kleene algebra, minus the annihilation axioms x.0 = 0 = 0.x. We show that, like Kleene algebra (KA), KS admits efficient elimination of various kinds of equational hypotheses, in particular Hoare formulas (x = 0). Our method is purely proof-theoretic, and can be used to eliminate Horn hypotheses in any suitable Horn-equa...

متن کامل

An Efficient Coq Tactic for Deciding Kleene Algebras

We present a reflexive tactic for deciding the equational theory of Kleene algebras in the Coq proof assistant. This tactic relies on a careful implementation of efficient finite automata algorithms, so that it solves casual equations almost instantaneously. The corresponding decision procedure was proved correct and complete; correctness is established w.r.t. any model (including binary relati...

متن کامل

On the Complexity of the Equational Theory of Relational Action Algebras

Pratt [22] defines action algebras as Kleene algebras with residuals. In [9] it is shown that the equational theory of *-continuous action algebras (lattices) is Π 1−complete. Here we show that the equational theory of relational action algebras (lattices) is Π 1−hard, and some its fragments are Π 1−complete. We also show that the equational theory of action algebras (lattices) of regular langu...

متن کامل

Feasibly Reducing KAT Equations to KA Equations

Kleene algebra (KA) is the algebra of regular events. Familiar examples of Kleene algebras include regular sets, relational algebras, and trace algebras. A Kleene algebra with tests (KAT) is a Kleene algebra with an embedded Boolean subalgebra. The addition of tests allows one to encode while programs as KAT terms, thus the equational theory of KAT can express (propositional) program equivalenc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Fundam. Inform.

دوره 68  شماره 

صفحات  -

تاریخ انتشار 2005